package vj.tree;

import java.util.Random;

public class Runner {

	/**
	 * @param args
	 */
	public static void main(String[] args) {

		BST bst = new BST();
		Random rand = new Random();
		for(int i = 0; i < 100; i++) 
			bst.insert(rand.nextInt(200));
		
		bst.printTree();
		System.out.println();
		bst.printReverseInorder();	
		
		int A = 80, B = 60, C;
		C = (A > B) ? A : B;
		System.out.println(" ");
		System.out.println(C);
		
		int arr1[] = new int[]{131, 133, 137, 49, 109, 49,  161, 63, 125, 139, 199, 137};// 131 133 137 49 109 161 63 125 139 199
		BST bst1 = new BST();
		for(int j = 0; j < arr1.length; j++)
			bst1.insert(arr1[j]);
		
		//BST.printPostOrder(bst.getRoot());
		BST.printLevelWise(bst1.getRoot());

	}

}
